Stack and Queue Layouts via Layered Separators

It is known that every proper minor-closed class of graphs has bounded stack-number (a.k.a. book thickness and page number). While this includes notable graph families such as planar graphs and graphs of bounded genus, many other graph families are not closed under taking minors. For fixed $g$ and $k$, we show that every $n$-vertex graph that can be embedded on a surface of genus $g$ with at most $k$ crossings per edge has stack-number $\mathcal{O}(\log n)$; this includes $k$-planar graphs. The previously best known bound for the stack-number of these families was $\mathcal{O}(\sqrt{n})$, except in the case of $1$-planar graphs. Analogous results are proved for map graphs that can be embedded on a surface of fixed genus. None of these families is closed under taking minors. The main ingredient in the proof of these results is a construction proving that $n$-vertex graphs that admit constant layered separators have $\mathcal{O}(\log n)$ stack-number.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016

Deep Adaptive Attention for Joint Facial Action Unit Detection and Face Alignment

Facial action unit (AU) detection and face alignment are two highly correlated tasks since facial landmarks can provide precise AU locations to facilitate the extraction of meaningful local features for AU detection. Most existing AU detection works often treat face alignment as a preprocessing and handle the two tasks independently. In this paper, we propose a novel end-to-end deep learning framework for joint AU detection and face alignment, which has not been explored before. In particular, multi-scale shared features are learned firstly, and high-level features of face alignment are fed into AU detection. Moreover, to extract precise local features, we propose an adaptive attention learning module to refine the attention map of each AU adaptively. Finally, the assembled local features are integrated with face alignment features and global features for AU detection. Experiments on BP4D and DISFA benchmarks demonstrate that our framework significantly outperforms the state-of-the-art methods for AU detection.Comment: This paper has been accepted by ECCV 201

Scalars, Vectors and Tensors from Metric-Affine Gravity

The metric-affine gravity provides a useful framework for analyzing gravitational dynamics since it treats metric tensor and affine connection as fundamentally independent variables. In this work, we show that, a metric-affine gravity theory composed of the invariants formed from non-metricity, torsion and curvature tensors can be decomposed into a theory of scalar, vector and tensor fields. These fields are natural candidates for the ones needed by various cosmological and other phenomena. Indeed, we show that the model accommodates TeVeS gravity (relativistic modified gravity theory), vector inflation, and aether-like models. Detailed analyses of these and other phenomena can lead to a standard metric-affine gravity model encoding scalars, vectors and tensors.Comment: 13 p

Numerical modeling of transient characteristics of photovoltage in Schottky contacts

Numerical modeling of the transient characteristics of the photovoltage at metal-semiconductor interfaces has been carried out with a simple model in which the contributions of different current transport processes including thermionic emission, tunneling, carrier recombination, and leakage current have been taken into account. The simulation gives the detailed dependence of the transient characteristics on temperature, doping concentration, Schottky barrier height, and leakage resistance. © 1994 American Institute of Physics.published_or_final_versio

Experimental stabilization of chaos in a voltage-mode DC drive system

This paper first presents experimental evidence on the use of delayed self-controlling feedback to stabilize chaos in a practical voltage-mode dc drive system. Also, a new analytical approach to compute the domain of stabilization is proposed. Based on a simple feedback loop, chaotic behavior can be successfully stabilized to fundamental or subharmonic operation using the same time delay.published_or_final_versio

Profiling of Glycan Receptors for Minute Virus of Mice in Permissive Cell Lines Towards Understanding the Mechanism of Cell Recognition

The recognition of sialic acids by two strains of minute virus of mice (MVM), MVMp (prototype) and MVMi (immunosuppressive), is an essential requirement for successful infection. To understand the potential for recognition of different modifications of sialic acid by MVM, three types of capsids, virus-like particles, wild type empty (no DNA) capsids, and DNA packaged virions, were screened on a sialylated glycan microarray (SGM). Both viruses demonstrated a preference for binding to 9-O-methylated sialic acid derivatives, while MVMp showed additional binding to 9-O-acetylated and 9-O-lactoylated sialic acid derivatives, indicating recognition differences. The glycans recognized contained a type-2 Galβ1-4GlcNAc motif (Neu5Acα2-3Galβ1-4GlcNAc or 3′SIA-LN) and were biantennary complex-type N-glycans with the exception of one. To correlate the recognition of the 3′SIA-LN glycan motif as well as the biantennary structures to their natural expression in cell lines permissive for MVMp, MVMi, or both strains, the N- and O-glycans, and polar glycolipids present in three cell lines used for in vitro studies, A9 fibroblasts, EL4 T lymphocytes, and the SV40 transformed NB324K cells, were analyzed by MALDI-TOF/TOF mass spectrometry. The cells showed an abundance of the sialylated glycan motifs recognized by the viruses in the SGM and previous glycan microarrays supporting their role in cellular recognition by MVM. Significantly, the NB324K showed fucosylation at the non-reducing end of their biantennary glycans, suggesting that recognition of these cells is possibly mediated by the Lewis X motif as in 3′SIA-LeX identified in a previous glycan microarray screen

A Simple Grand Unified Relation between Neutrino Mixing and Quark Mixing

It is proposed that all flavor mixing is caused by the mixing of the three quark and lepton families with vectorlike fermions in 5 + 5-bar multiplets of SU(5). This simple assumption implies that both V_{CKM} and U_{MNS} are generated by a single matrix. The entire 3-by-3 complex mass matrix of the neutrinos M_{nu} is then found to have a simple expression in terms of two complex parameters and an overall scale. Thus, all the presently unknown neutrino parameters are predicted. The best fits are for theta_{atm} less than or approximately 40 degrees. The leptonic Dirac CP phase is found to be somewhat greater than pi radians.Comment: 10 pages, 4 figures, one table. Typos correcte

Unsupervised binning of environmental genomic fragments based on an error robust selection of l-mers

BACKGROUND: With the rapid development of genome sequencing techniques, traditional research methods based on the isolation and cultivation of microorganisms are being gradually replaced by metagenomics, which is also known as environmental genomics. The first step, which is still a major bottleneck, of metagenomics is the taxonomic characterization of DNA fragments (reads) resulting from sequencing a sample of mixed species. This step is usually referred as 'binning'. Existing binning methods are based on supervised or semi-supervised approaches which rely heavily on reference genomes of known microorganisms and phylogenetic marker genes. Due to the limited availability of reference genomes and the bias and instability of marker genes, existing binning methods may not be applicable in many cases. RESULTS: In this paper, we present an unsupervised binning method based on the distribution of a carefully selected set of l-mers (substrings of length l in DNA fragments). From our experiments, we show that our method can accurately bin DNA fragments with various lengths and relative species abundance ratios without using any reference and training datasets. Another feature of our method is its error robustness. The binning accuracy decreases by less than 1% when the sequencing error rate increases from 0% to 5%. Note that the typical sequencing error rate of existing commercial sequencing platforms is less than 2%. CONCLUSIONS: We provide a new and effective tool to solve the metagenome binning problem without using any reference datasets or markers information of any known reference genomes (species). The source code of our software tool, the reference genomes of the species for generating the test datasets and the corresponding test datasets are available at http://i.cs.hku.hk/alse/MetaCluster/.published_or_final_versio

Expanding the scope of N → S acyl transfer in native peptide sequences

Understanding the factors that influence N → S acyl transfer in native peptide sequences, and discovery of new reagents that facilitate it, will be key to expanding its scope and applicability. Here, through a study of short model peptides in thioester formation and cyclisation reactions, we demonstrate that a wider variety of Xaa-Cys motifs than originally envisaged are capable of undergoing efficient N → S acyl transfer. We present data for the relative rates of thioester formation and cyclisation for a representative set of amino acids, and show how this expanded scope can be applied to the production of the natural protease inhibitor Sunflower Trypsin Inhibitor-1 (SFTI-1)